Probabilistic complexity theory - PDFSEARCH.IO - Document Search Engine

Probabilistic complexity theory
Results: 385

#	Item
131	Proofs that Yield All Languages Proof Add to Reading List Source URL: nakamotoinstitute.org Language: English - Date: 2014-03-23 11:48:58 Complexity classes Cryptographic protocols Probabilistic complexity theory Models of computation Interactive proof system Zero-knowledge proof NP IP Arthur–Merlin protocol Theoretical computer science Computational complexity theory Applied mathematics
132	Chapter 6: Randomization Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:11:44 Randomness Analysis of algorithms Probabilistic complexity theory Design of experiments Randomized algorithm Random number generation Randomization NL Adversary model Theoretical computer science Computational complexity theory Applied mathematics
133	Round-Optimal Zero-Knowledge Proofs of Knowledge for NP Li HongDa†1 , Feng DengGuo2 , Li Bao1 , Xu HaiXia1 1 State Key Lab of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, C Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-15 09:42:20 Cryptographic protocols Probabilistic complexity theory Complexity classes Interactive proof system Proof of knowledge Zero-knowledge proof IP Soundness Commitment scheme Theoretical computer science Applied mathematics Computational complexity theory
134	Unprovable Security of Two-Message Zero Knowledge Kai-Min Chung∗ Edward Lui∗ Mohammad Mahmoody∗ Rafael Pass∗ December 19, 2012 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-19 11:29:49 Complexity classes Cryptographic protocols Probabilistic complexity theory Interactive proof system Probabilistically checkable proof IP Soundness Zero-knowledge proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
135	Multiplicative approximations of random walk transition probabilities Michael Kapralov∗ Rina Panigrahy† June 17, 2011 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Random walk NP-complete problems Algebraic graph theory Centrality Tutte polynomial Theoretical computer science Computational complexity theory Mathematics
136	Microsoft Word - POP Candidates 2007_ETHZ-corr7.doc Add to Reading List Source URL: www.pops.int Language: English - Date: 2008-05-02 10:36:22 Measurement Monte Carlo method Numerical analysis Probabilistic complexity theory Octabromodiphenyl ether Uncertainty POV Soil Statistics Probability and statistics Science
137	Power Computation for Testing the Difference Between Two Lognormal Means Consider two lognormal distributions: lognormal(µ1 , σ12 ) and lognormal(µ2 , σ22 ). The mean of the ith distribution is given by exp(ηi ), wh Add to Reading List Source URL: www.ucs.louisiana.edu Language: English - Date: 2003-02-01 15:36:52 Randomness Monte Carlo method Numerical analysis Probabilistic complexity theory Log-normal distribution Normal distribution Probability and statistics Statistics Mathematical analysis
138	The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch† Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:17:36 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Set cover problem Competitive analysis Algorithm Randomized rounding Euclidean algorithm Mathematics Theoretical computer science Applied mathematics
139	Sustaining Moore’s Law in Embedded Computing through Probabilistic and Approximate Design: Retrospects and Prospects Krishna V. Palem Lakshmi N.B. Chakrapani Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 22:20:27 Electronic design Probabilistic complexity theory Digital electronics Integrated circuits Logic families Krishna Palem Randomized algorithm PP Probabilistic logic Theoretical computer science Electronic engineering Computational complexity theory
140	Ultra-Efficient (Embedded) SOC Architectures based on Probabilistic CMOS (PCMOS) Technology∗ Lakshmi N. Chakrapani Bilge E. S. Akgul Suresh Cheemalavagu Krishna V. Palem Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 22:04:00 Probabilistic complexity theory Integrated circuits PSoC Randomized algorithm Probabilistic logic Probabilistic design PP Monte Carlo method Pattern recognition Theoretical computer science Applied mathematics Computational complexity theory

UPDATE